Truncated $L^1$ Regularized Linear Regression: Theory and Algorithm
نویسندگان
چکیده
منابع مشابه
Multiplicative Updates for L1-Regularized Linear and Logistic Regression
Multiplicative update rules have proven useful in many areas of machine learning. Simple to implement, guaranteed to converge, they account in part for the widespread popularity of algorithms such as nonnegative matrix factorization and Expectation-Maximization. In this paper, we show how to derive multiplicative updates for problems in L1-regularized linear and logistic regression. For L1–regu...
متن کاملFast Active-set-type Algorithms for L1-regularized Linear Regression
In this paper, we investigate new active-settype methods for l1-regularized linear regression that overcome some difficulties of existing active set methods. By showing a relationship between l1-regularized linear regression and the linear complementarity problem with bounds, we present a fast active-set-type method, called block principal pivoting. This method accelerates computation by allowi...
متن کاملEfficient L1 Regularized Logistic Regression
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized logistic regression requires solving a convex optimization problem. However, standard algorithms for solving convex optimization problems do not scale well enough to handle the large datasets encountered in many pract...
متن کاملl1-regularized Outlier Isolation and Regression
This paper proposed a new regression model called l1regularized outlier isolation and regression (LOIRE) and a fast algorithm based on block coordinate descent to solve this model. Besides, assuming outliers are gross errors following a Bernoulli process, this paper also presented a Bernoulli estimate model which, in theory, should be very accurate and robust due to its complete elimination of ...
متن کاملOn the l1-lq Regularized Regression
In this paper we consider the problem of grouped variable selection in high-dimensional regression using `1-`q regularization (1 ≤ q ≤ ∞), which can be viewed as a natural generalization of the `1-`2 regularization (the group Lasso). The key condition is that the dimensionality pn can increase much faster than the sample size n, i.e. pn À n (in our case pn is the number of groups), but the numb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Computational Physics
سال: 2022
ISSN: ['1991-7120', '1815-2406']
DOI: https://doi.org/10.4208/cicp.oa-2020-0250